The Strange Man in Random Networks of Automata
نویسندگان
چکیده
We have performed computer simulations of Kauffman’s automata on several graphs such as the regular square lattice and invasion percolation clusters in order to investigate phase transitions, radial distributions of the mean total damage (dynamical exponent z) and propagation speeds of the damage when one adds a damaging agent, nicknamed ”strange man”. Despite the increase in the damaging efficiency, we have not observed any appreciable change of the transition threshold to chaos neither for the short-range nor for the small-world case on the square lattices when the strange man is added in comparison to when small initial damages are inserted in the system. The propagation speed of the damage cloud until touching the border of the system in both cases obeys a power law with a critical exponent α that strongly depends on the lattice. Particularly, we have ckecked the damage spreading when some connections are removed on the square lattice and when one considers special invasion percolation clusters (high boundary-saturation clusters). It is seen that the propagation speed in these systems is quite sensible to the degree of dilution on the square lattice and to the degree of saturation on invasion percolation clusters.
منابع مشابه
A Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملUsing an Evaluator Fixed Structure Learning Automata in Sampling of Social Networks
Social networks are streaming, diverse and include a wide range of edges so that continuously evolves over time and formed by the activities among users (such as tweets, emails, etc.), where each activity among its users, adds an edge to the network graph. Despite their popularities, the dynamicity and large size of most social networks make it difficult or impossible to study the entire networ...
متن کاملA Link Prediction Method Based on Learning Automata in Social Networks
Nowadays, online social networks are considered as one of the most important emerging phenomena of human societies. In these networks, prediction of link by relying on the knowledge existing of the interaction between network actors provides an estimation of the probability of creation of a new relationship in future. A wide range of applications can be found for link prediction such as electro...
متن کاملCreating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملDesign of low power random number generators for quantum-dot cellular automata
Quantum-dot cellular automata (QCA) are a promising nanotechnology to implement digital circuits at the nanoscale. Devices based on QCA have the advantages of faster speed, lower power consumption, and greatly reduced sizes. In this paper, we are presented the circuits, which generate random numbers in QCA. Random numbers have many uses in science, art, statistics, cryptography, gaming, gambli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007